Ridge–Valley graphs: Combinatorial ridge detection using Jacobi sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ridge-Valley graphs: Combinatorial ridge detection using Jacobi sets

Ridges are one of the key feature of interest in areas such as computer vision and image processing. Even though a significant amount of research has been directed to defining and extracting ridges some fundamental challenges remain. For example, the most popular ridge definition (height ridge) is not invariant under monotonic transformations and its global structure is typically ignored during...

متن کامل

Combinatorial algorithms for graphs and partially ordered sets

In this thesis we study combinatorial and algorithmic problems for graphs and partially ordered sets. The thesis is centered around four themes: planar graphs, reachability, order dimension and special cases of NP-hard problems. The results presented are of both algorithmic and structural flavor. The thesis begins with an overview of the problems considered and an introduction to the necessary ...

متن کامل

A combinatorial algorithm for weighted stable sets in bipartite graphs

Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorithms. We present a combinatorial algorithm for the problem that is not based on flows. Numerical tests suggest that this algorithm performs quite well in practice and is competitive with flow based algorithms especially in the ca...

متن کامل

Combinatorial reasoning for sets, graphs and document composition

Combinatorial optimization problems require selecting the best solution from a discrete (albeit often extremely large) set of possible candidates. These problems arise in a diverse range of fields, and tend to be quite challenging. Rather than developing a specialised algorithm for each problem, however, modern approaches to solving combinatorial problems often involve transforming the problem ...

متن کامل

Combinatorial Problems for Graphs and Partially Ordered Sets

To my family. iii ACKNOWLEDGEMENTS I spent my past six and a half years at Tech, which is longer than most other graduate students did. As a result, I got to know more faculties, staffs and students who guided and supported me during my graduate studies. I owe a lot of thanks to them. First and foremost, I would like to express my deepest gratitude to my advisor, Tom Trotter, for his persistent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Aided Geometric Design

سال: 2013

ISSN: 0167-8396

DOI: 10.1016/j.cagd.2012.03.015